Pattern matching image compression: algorithmic and empirical results
نویسندگان
چکیده
منابع مشابه
Pattern Matching Image Compression: Algorithmic and Empirical Results
ÐWe propose a nontransform image compression scheme based on approximate one-dimensional pattern matching that we name Pattern Matching Image Compression (PMIC). The main idea behind it is a lossy extension of the Lempel-Ziv data compression scheme in which one searches for the longest prefix of an uncompressed image that approximately occurs in the already processed image (e.g., in the sense o...
متن کاملPattern Matching Image Compression
We propose a non-transform image compression scheme based on approximate pattern matching, that we name Pattern Matching Image Compression (PMIC). The main idea behind it is a lossy extension of the Lempel-Ziv data compression scheme in which one searches for the longest prefix of an uncompressed image that approzimately occurs in the already processed image. We consider both the Hamming distan...
متن کاملPattern Matching Image Compression with Predication Loop: Preliminary Experimental Results
Recently, a novel image compression technique based on pattern matching was proposed, namely Pattern Matching Image Compression (PMIC). Basically, it is a lossy extension of the well known Lempel-Ziv scheme. It was proved that such an extension leads to a suboptimal compression, and that the compression ratio can as low as the so called R enyi entropy. Success of PMIC crucially depends on sever...
متن کاملText Image Compression Using Soft Pattern Matching
We present a method for both lossless and lossy compression of bi-level images that consist mostly of printed or typed text. The key feature of the method is soft pattern matching, a way of making use of the information in previously encountered characters without risking the introduction of character substitution errors. We can obtain lossless compression which is about 20% better than that of...
متن کاملA pattern matching approach to image compression
We propose an image compression scheme based on approximate pattern matching, that we name Pattern Matching Image Compression (PMIC). We give new, eecient algorithms for performing computations motivated by this scheme, and describe the compression ratios experimentally obtained. The main idea is a lossy extension of the Lempel-Ziv data compression scheme in which one searches for the longest p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 1999
ISSN: 0162-8828
DOI: 10.1109/34.777372